Refinement of Interface Automata Strengthened by Action Semantics
نویسندگان
چکیده
منابع مشابه
Refinement by Interface Instantiation
Decomposition is a technique to separate the design of a complex system into smaller sub-models, which improves scalability and team development. In the shared-variable decomposition approach for Event-B sub-models share external variables and communicate through external events which cannot be easily refined. Our first contribution hence is a proposal for a new construct called interface that ...
متن کاملInitial Semantics for Strengthened Signatures
We give a new general definition of arity, yielding the companion notions of signature and associated syntax. This setting is modular in the sense requested by [12]: merging two extensions of syntax corresponds to building an amalgamated sum. These signatures are too general in the sense that we are not able to prove the existence of an associated syntax in this general context. So we have to s...
متن کاملFull Abstractness of an Interleaving Semantics for Action Refinement
For an abstract programming language with action reenement both an operational and a denotational semantics are given. The operational semantics is based on an SOS-style transition system speciication involving syntactical reenement sequences. The denotational semantics is an interleaving model which uses semantical reenementènvironments'. It identiies those statements which are equal under all...
متن کاملInterleaving semantics and action refinement with atomic choice
We investigate how to restrict the concept of action reenement such that established in-terleaving equivalences for concurrent systems are preserved under these restricted reene-ments. We show that interleaving bisimulation is preserved under reenement if we do not allow to reene action occurrences deciding choices and action occurrences involved in auto-concurrency. On the other hand, interlea...
متن کاملRelating maximality-based semantics to action refinement in process algebras
This paper extends to process algebras the notion of maximality which has initially been introduced for prime event structures and P/T nets and shows how this notion of maximality may be used for deening an adequate semantics of Basic LOTOS able to support action reenement. Such an approach appears to be more convenient than the classical ST-semantics where non atomic actions are split into sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.09.031